Solving the Gale-Shapley Problem by Ant-Q learning

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hospitals / Residents Problem (1962; Gale, Shapley)

An instance I of the Hospitals / Residents problem (HR) [6, 7, 15] involves a set R = {r1, . . . , rn} of residents and a set H = {h1, . . . , hm} of hospitals. Each hospital hj ∈ H has a positive integral capacity, denoted by cj . Also, each resident ri ∈ R has a preference list in which he ranks in strict order a subset of H. A pair (ri, hj) ∈ R ×H is said to be acceptable if hj appears in ri...

متن کامل

Solving the Airline Recovery Problem By Using Ant Colony Optimization

  In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications

This paper is motivated by a study of the mechanism used to assign primary school students in Singapore to secondary schools. The assignment process requires that primary school students submit a rank ordered list of six schools to the Ministry of Education. Students are then assigned to secondary schools based on their preferences, with priority going to those with the highest examination scor...

متن کامل

Sisterhood in the Gale-Shapley Matching Algorithm

Lying in order to manipulate the Gale-Shapley matching algorithm has been studied by Dubins and Freedman (1981) and by Gale and Sotomayor (1985), and was shown to be generally more appealing to the proposed-to side (denoted as the women in Gale and Shapley’s seminal paper (1962)) than to the proposing side (denoted as men there). It can also be shown that in the case of lying women, for every w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The KIPS Transactions:PartB

سال: 2011

ISSN: 1598-284X

DOI: 10.3745/kipstb.2011.18b.3.165